Diclib.com
Dicionário ChatGPT

Pesquisa de dicionário Soluções personalizadas

Digite uma palavra ou frase em qualquer idioma 👆

Idioma:

Tradução e análise de palavras por inteligência artificial ChatGPT

Nesta página você pode obter uma análise detalhada de uma palavra ou frase, produzida usando a melhor tecnologia de inteligência artificial até o momento:

como a palavra é usada
frequência de uso
é usado com mais frequência na fala oral ou escrita
opções de tradução de palavras
exemplos de uso (várias frases com tradução)
etimologia

well deepening - tradução para russo

Depth-limited search; ITDFS; Iterative deepening; IDDFS; DFSID; Depth-first search with iterative deepening; Iterative deepening search

well deepening

нефтегазовая промышленность

углубление скважины

well ordered

TOTAL ORDER SUCH THAT EVERY NONEMPTY SUBSET OF THE DOMAIN HAS A LEAST ELEMENT

Well-ordered set; Well-ordered; Well-ordering; Well ordered; Well ordering; Well-ordering property; Wellorder; Wellordering; Well ordered set; Wellordered; Well ordering theory; Well ordering property; Well-Ordering; Well-Ordered; Well-orderable set; Well order

математика

вполне упорядоченный

well-ordered

TOTAL ORDER SUCH THAT EVERY NONEMPTY SUBSET OF THE DOMAIN HAS A LEAST ELEMENT

Well-ordered set; Well-ordered; Well-ordering; Well ordered; Well ordering; Well-ordering property; Wellorder; Wellordering; Well ordered set; Wellordered; Well ordering theory; Well ordering property; Well-Ordering; Well-Ordered; Well-orderable set; Well order

well-ordered adj. упорядоченный

Definição

well-ordered set

<mathematics> A set with a total ordering and no infinite descending chains. A total ordering "<=" satisfies x <= x x <= y <= z => x <= z x <= y <= x => x = y for all x, y: x <= y or y <= x In addition, if a set W is well-ordered then all non-empty subsets A of W have a least element, i.e. there exists x in A such that for all y in A, x <= y. Ordinals are isomorphism classes of well-ordered sets, just as integers are isomorphism classes of finite sets. (1995-04-19)

Mostrar mais definições

Wikipédia

Iterative deepening depth-first search

In computer science, iterative deepening search or more specifically iterative deepening depth-first search (IDS or IDDFS) is a state space/graph search strategy in which a depth-limited version of depth-first search is run repeatedly with increasing depth limits until the goal is found. IDDFS is optimal like breadth-first search, but uses much less memory; at each iteration, it visits the nodes in the search tree in the same order as depth-first search, but the cumulative order in which nodes are first visited is effectively breadth-first.

https://en.wikipedia.org/wiki/Iterative deepening depth-first search

Como se diz well deepening em Russo? Tradução de &#39well deepening&#39 em Russo